| 1. | Research on vehicle secure feasible region based on computer vision
基于计算机视觉的汽车安全可行区域研究 |
| 2. | If the feasible region was empty , the interval vector could be excluded
若可行域为空，则可排除该区间向量。 |
| 3. | Without any superstructures of distillation system , the feasible region could be looked for automatically
在不必给定精馏系统超结构的情况下，能够完成可行域的自动搜寻。 |
| 4. | Solution will convergent to optimal point of feasibility through penalty of solution outside feasible region again and again
通过对可行域外的解进行惩罚，经过不断迭代，使解群逐渐收敛于可行的最优点。 |
| 5. | Continuing above curse , then we can get its optimum solution , that is to say , starting from some feasible vertex , we will get the optimum solution of some linear programming problem after finite times transition of vertex along edge of feasible region
继续上述过程，就能求得线性规划问题的最优解。这就是说，自可行域的某顶点出发，沿可行域的棱经过若干次可行域顶点的转移后，就能得到线性规划问题的最优解(在最优解存在的情况下) 。 |
| 6. | One is based on the bounded simplex method . at first , nonlinear equations was transferred to linear equations whose feasible region contained all solutions in the given interval vector , then the bounded simplex method was used to determine whether the feasible region was empty or not
有界变量单纯形法：首先将非线性问题转化为带约束条件的线性规划问题，该线性规划的可行域包含了所给区间向量范围内的所有解，然后使用有界变量的单纯形法判断可行域是否为空。 |
| 7. | If some linear programming problem has optimum solution , then there must at least exist such a edge among ali edges passing through some known vertex of feasible region that the objective function value of the other vertex is more optimic than the one of the known vertex , otherwise , the known vertex is the optimum solution of the linear programming problem
如果线性规划问题有最优解，那么过可行域的一已知顶点必至少存在这样一条棱? ?它以该己知顶点为一端点，可行域的另一顶点为另一端点，并使目标函数在另一端点的函数值优于己知端点的函数值，否则，该己知点就是线性规划问题的最优解。 |
| 8. | Then we propose the problems that will be discussed in the following papers . also , we introduce the theory in the field of feasible region for semi - infinite programming , and concluded that in some area around the feasible points , feasible region can be expressed by finite inequality constraints , this results gives a base to the following algorithms
接着介绍了半无限规划可行域的结构和稳定点的稳定性，指出了关于可行域结构理论研究的现状，并指出在一定的条件下，在可行点的局部邻域内，可行域可以有有限个不等式约束来表示，这为第二、三章半无限规划问题的算法提供了理论基础。 |
| 9. | In section one , based on theory of n dimensional euclid space , a new method labeled as " pointlineplane " recycling optimization algorithm is proposed to solve the linear programming problem . this algorithm is proposed on the basis of the thought as follovvs : as for three dimensional euclid space , the feasible region of any linear programming problem is a extended convex polyhedron , of which surface is consisted of some planes , and its objective function can be regarded as a parallel plane pencil with objective function value acting as parameter
第一部分内容是在n维欧氏空间理论的基础上提出了一种求解线性规划问题的新算法? “点线面”循环寻优法，本算法是基于如下思想提出来的：我们知道，在三维欧氏空间中，线性规划问题的可行域是一个由若干个平面围成的广义多面体，目标函数可以看作是以目标函数值为参变量的一个平行平面束。 |
| 10. | Based on the facts that time of arrival ( toa ) of the first multipath signal is always most close to that of los propagation and angle of arrival ( aoa ) of the first multipath signal is not always most close to that of los propagation among all multipath signals in nlos propagation environment , a location algorithm is proposed to mitigate the influence of nlos propagation , which effectively reduces the feasible region of a ms in macrocells
依据在非视距传播环境下存在的以下两个事实：第一，最先到达多径信号的波达时间总是最接近直达波的波达时间。第二，最先到达多径信号的波达方向并不一定最接近直达波方向。针对宏蜂窝系统，从有效减小移动台可行域的角度，提出了一种减轻非视距影响的定位算法。 |
